Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
21	Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone: Add to Reading List Source URL: students.ceid.upatras.gr Language: English - Date: 2006-02-09 03:56:19 Theoretical computer science Computational complexity theory Mathematics Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Symposium on Discrete Algorithms Approximation algorithm Random walk 2-satisfiability
22	Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:44 Graph theory Mathematics Computational complexity theory Operations research Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Travelling salesman problem A* search algorithm Flow network Tree traversal
23	Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-Soriano Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2016-05-05 08:42:00 Mathematics Graph theory Computational complexity theory Approximation algorithm Randomized algorithm Networks Graphical models Centrality Belief propagation
24	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm
25	SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-03-13 08:17:47 Computational complexity theory Mathematics NP-complete problems Theory of computation Set cover problem Approximation algorithm Algorithm Analysis of algorithms Bin packing problem Vertex cover
26	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity
27	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:33 Graph theory Mathematics Computational complexity theory NP-hard problems NP-complete problems Edsger W. Dijkstra Combinatorial optimization Approximation algorithms Travelling salesman problem Shortest path problem Matching Randomized algorithm
28	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-20 20:42:54 Graph theory Computational complexity theory Mathematics NP-complete problems Graph connectivity Combinatorial optimization Cut Approximation algorithm Randomized algorithm Independent set Semidefinite programming Randomized rounding
29	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-03-26 07:24:20 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Steiner tree problem Shortest path problem Linear programming Edge disjoint shortest pair algorithm Minimum bottleneck spanning tree
30	Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:47 Mathematical optimization Computational complexity theory Theory of computation Applied mathematics Academia Evolutionary algorithms Operations research Cybernetics Multi-objective optimization Reduction Algorithm CMA-ES